Constructing concrete hard instances of the maximum independent set problem
نویسندگان
چکیده
منابع مشابه
An exact algorithm exhibiting RS-RSB/easy-hard correspondence for the maximum independent set problem
A recently proposed exact algorithm for the maximum independent set problem is analyzed. The typical running time is improved exponentially in some parameter regions compared to simple binary search. The algorithm also overcomes the core transition point, where the conventional leaf removal algorithm fails, and works up to the replica symmetry breaking (RSB) transition point. This suggests that...
متن کاملFinding Hard Instances of the Satisfiability Problem
Finding sets of hard instances of propositional satissability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we consider the performance of the most popular SAT algorithms on random problems, the theory of average case complexity, the threshold phenomenon, known lower bounds for certain classes of algorithms, and the ...
متن کاملThe Maximum Independent Set Problem in Subclasses of Subcubic Graphs
The Maximum Independent Set problem is NP-hard and remains NP-hard for graphs with maximum degree three (also called subcubic graphs). In our talk we will study its complexity in hereditary subclasses of subcubic graphs. Let A r q be the graph consisting of an induced cycle C q and an induced path with r edges having an endvertex in common with the C q , where A 1 4 is known as the banner. Our ...
متن کاملA Variant of the Maximum Weight Independent Set Problem
We study a natural extension of the Maximum Weight Independent Set Problem (MWIS), one of the most studied optimization problems in Graph algorithms. We are given a graph G = (V,E), a weight function w : V → R, a budget function b : V → Z, and a positive integer B. The weight (resp. budget) of a subset of vertices is the sum of weights (resp. budgets) of the vertices in the subset. A k-budgeted...
متن کاملA novel evolutionary formulation of the maximum independent set problem
We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph’s independence number and its acyclic orientations. It views such orientations as individuals and evolves them with the aid of evolutionary operators that are very heavily based on the structure of the graph an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2019
ISSN: 1742-5468
DOI: 10.1088/1742-5468/ab409d